| description |
New scenarios in wireless sensor networks, where several independent
sinks can ask for different kinds of data, are currently emerging.
Former algorithms that route data to a centralized sink, are not
appropriate for these scenarios. First solutions for these
multi-source to multi-sink scenarios simply create independent trees
for each source. As a result, some nodes become hot-spots, since
they are included in several trees, whereas nodes around them remain
unused. In this paper, we propose a new algorithm that balances the
load evenly in the network, extending the network lifetime, while
still providing a small delay in packet delivery. Based on the
information of one-hop neighbors and the number of hops to the
sinks, the algorithm attempts to reduce both the delay and the power
consumption. We present the cost function used to select the next
hop(s) towards the sinks. The evaluation of the protocol
demonstrates its ability to fulfill its target.
|